Critical Random Graphs: Limiting Constructions and Distributional Properties
نویسندگان
چکیده
منابع مشابه
Critical random graphs: limiting constructions and distributional properties
We consider the Erdős–Rényi random graph G(n, p) inside the critical window, where p = 1/n + λn−4/3 for some λ ∈ R. We proved in [1] that considering the connected components of G(n, p) as a sequence of metric spaces with the graph distance rescaled by n−1/3 and letting n→∞ yields a non-trivial sequence of limit metric spaces C = (C1,C2, . . . ). These limit metric spaces can be constructed fro...
متن کاملConstructions of k-critical P5-free graphs
4 With respect to a class C of graphs, a graph G ∈ C is said to be k-critical if every proper 5 subgraph of G belonging to C is k−1 colorable. We construct an infinite set of k-critical P56 free graphs for every k ≥ 5. We also prove that there are exactly eight 5-critical {P5, C5}-free 7 graphs. 8
متن کاملProperties of Random Difference Graphs
Generate a bipartite graph on a partitioned set of vertices by randomly assigning to each vertex v some weight w(v) ∈ [0, 1] and adding an edge between vertices u and v (in distinct parts) if and only if w(u)+w(v) > 1; the results of such processes are known as difference graphs. Random difference graphs of a given size can be produced either by uniformly random generation of weights or by choo...
متن کاملProperties of Random Graphs via
We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irre-ducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general classes of polynomials. For example, we prove that the number of degree n polynomials of Hamming distance one from a randomly chosen set of 2 n /n ...
متن کاملConstructions of independent sets in random intersection graphs
The considered problem concerns constructing independent sets in a random intersection graph. We concentrate on two cases of the model: a binomial and a uniform random intersection graph. For both models we analyse two greedy algorithms and prove that they find asymptotically almost optimal independent sets. We provide detailed analysis of the presented algorithms and give tight bounds on the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2010
ISSN: 1083-6489
DOI: 10.1214/ejp.v15-772